package com.programmercarl.tree;

/**
 * https://leetcode.cn/problems/delete-node-in-a-bst/description/
 *
 * @author yulongtian
 * @create 2024-12-25 13:15
 */
public class Test24 {
    public static void main(String[] args) {
//        Test24 test24 = new Test24();
//        try {
//            test24.testDfs();
//
//        } catch (Exception e) {
//            e.printStackTrace();
//            throw e;
//        }
    }

    public void testDfs() {
        testDfs();
    }

    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }


    public TreeNode deleteNode(TreeNode root, int key) {
        if (root == null) {
            return root;
        }
        if (root.val == key) {
            if (root.left == null && root.right == null) {
                return null;
            } else if (root.left == null) {
                return root.right;
            } else if (root.right == null) {
                return root.left;
            } else {
                TreeNode cur = root.right;
                while (cur.left != null) {
                    cur = cur.left;
                }
                cur.left = root.left;
                root = root.right;
                return root;
            }
        }
        if (key < root.val) {
            root.left = deleteNode(root.left, key);
        }
        if (key > root.val) {
            root.right = deleteNode(root.right, key);
        }
        return root;
    }
}
